ISRO CSE 2013
Q31.
A particular parallel program computation requires 100 seconds when executed on a single CPU. If 20% of this computation is strictly sequential, then theoretically the best possible elapsed times for this program running on 2 CPUs and 4 CPUs respectively areQ32.
A starvation free job scheduling policy guarantees that no job indefinitely waits for a service. Which of the following job scheduling policies is starvation free?Q33.
A CPU scheduling algorithm determines an order for the execution of its scheduled processes. Given 'n' processes to be scheduled on one processor, how many possible different schedules are there?Q34.
Consider the following set of processes, with arrival times and the required CPU-burst times given in milliseconds. \begin{array}{|l|l|l|l|} \hline \textbf{Process} & \textbf{Arrival time} & \textbf{Burst Time} \\\hline \text{$P_1$} & \text{0} & \text{4} \\\hline \text{$P_2$} & \text{2} & \text{2} \\\hline \text{$P_3$}& \text{3} & \text{1} \\\hline \end{array} What is the sequence in which the processes are completed? Assume round robin scheduling with a time quantum of 2 milliseconds?Q36.
If the frame to be transmitted is 1101011011 and the CRC polynomial to be used for generating checksum is x^{4}+x+1, than what is the transmitted frame?Q37.
How many check bits are required for 16 bit data word to detect 2 bit errors and single bit correction using hamming code?Q38.
What will be the efficiency of a Stop and Wait protocol, if the transmission time for a frame is 20ns and the propagation time is 30ns?Q40.
Consider the following process and resource requirement of each process.\begin{array}{|c|c|c|c|c|} \hline {\text { Process }} & {\text { Type 1 }} & {\text { Type 1 }} & {\text { Type 2 }}& {\text { Type 2 }} \\ \hline & \text { Used } & \text { Max } & \text { Used } & \text { Max } \\ \hline \text { P1 } & 1 & 2 & 1 & 3 \\ \hline \text { P2 } & 1 & 3 & 1 & 2 \\ \hline \text { P3 } & 2 & 4 & 1 & 4 \\ \hline \end{array}Predict the state of this system, assuming that there are a total of 5 instances of resource type 1 and 4 instances of resource type 2.